Implicit Runge-kutta Methods for Uncertainty Propagation
نویسندگان
چکیده
Accurate and efficient orbital propagators are critical for space situational awareness because they drive uncertainty propagation which is necessary for tracking, conjunction analysis, and maneuver detection. Existing sigma pointor particle-based methods for uncertainty propagation use explicit numerical integrators for propagating the closely spaced orbital states as part of the prediction step of the nonlinear filter (e.g. the unscented Kalman filter, Gaussian sum filter, or particle filter). As such, these methods cannot exploit the proximity of the orbital states, and each orbit is propagated independently. To remove this limitation and enable the orbital states to be propagated together, we have developed an implicit Runge-Kutta-based method for uncertainty propagation, and consider the propagation of the 13 sigma points needed to represent uncertainty (of a six-dimensional Gaussian state) in the unscented Kalman filter. In some cases, we can propagate uncertainty using the new propagator at about the same computational cost compared to that of propagating a single orbital state, even before the algorithm is potentially parallelized. The new propagator is applicable to all regimes of space, and additional features include its ability to estimate and control the truncation error, exploit analytic and semi-analytic methods, and provide accurate ephemeris data via built-in interpolation.
منابع مشابه
Implicit Runge-Kutta Methods for Orbit Propagation
Accurate and efficient orbital propagators are critical for space situational awareness because they drive uncertainty propagation which is necessary for tracking, conjunction analysis, and maneuver detection. We have developed an adaptive, implicit Runge-Kuttabased method for orbit propagation that is superior to existing explicit methods, even before the algorithm is potentially parallelized....
متن کاملFATODE: A Library for Forward, Adjoint, and Tangent Linear Integration of ODEs
Fatode is a fortran library for the integration of ordinary differential equations with direct and adjoint sensitivity analysis capabilities. The paper describes the capabilities, implementation, code organization, and usage of this package. Fatode implements four families of methods – explicit Runge-Kutta for nonstiff problems and fully implicit Runge-Kutta, singly diagonally implicit Runge-Ku...
متن کاملAdditive Semi-Implicit Runge-Kutta Methods for Computing High-Speed Nonequilibrium Reactive Flows
This paper is concerned with time-stepping numerical methods for computing sti semi-discrete systems of ordinary di erential equations for transient hypersonic ows with thermo-chemical nonequilibrium. The sti ness of the equations is mainly caused by the viscous ux terms across the boundary layers and by the source terms modeling nite-rate thermo-chemical processes. Implicit methods are needed ...
متن کاملGPU Implementation of Implicit Runge-Kutta Methods
Runge-Kutta methods are an important family of implicit and explicit iterative methods used for the approximation of solutions of ordinary differential equations. Explicit RungeKutta methods are unsuitable for the solution of stiff equations as their region of stability is small. Stiff equation is a differential equation for which certain numerical methods for solving the equation are numerical...
متن کاملAchieving Brouwer’s law with implicit Runge–Kutta methods
In high accuracy long-time integration of differential equations, round-off errors may dominate truncation errors. This article studies the influence of round-off on the conservation of first integrals such as the total energy in Hamiltonian systems. For implicit Runge–Kutta methods, a standard implementation shows an unexpected propagation. We propose a modification that reduces the effect of ...
متن کامل